Factoring in Embedding Dimension Three Numerical Semigroups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factoring in Embedding Dimension Three Numerical Semigroups

Let us consider a 3-numerical semigroup S = 〈a, b,N 〉. Given m ∈ S, the triple (x, y, z) ∈ N3 is a factorization of m in S if xa+ yb+ zN = m. This work is focused on finding the full set of factorizations of any m ∈ S and as an application we compute the catenary degree of S. To this end, we relate a 2D tessellation to S and we use it as a main tool.

متن کامل

on numerical semigroups with embedding dimension three

let $fneq1,3$ be a positive integer‎. ‎we prove that there exists a numerical semigroup $s$ with embedding dimension three such that $f$ is the frobenius number of $s$‎. ‎we also show that‎ ‎the same fact holds for affine semigroups in higher dimensional monoids‎.

متن کامل

On Numerical Semigroups with Embedding Dimension Three

Let f ̸= 1, 3 be a positive integer. We prove that there exists a numerical semigroup S with embedding dimension three such that f is the Frobenius number of S. We also show that the same fact holds for affine semigroups in higher dimensional monoids.

متن کامل

Numerical semigroups with maximal embedding dimension

Even though the study and relevance of maximal embedding dimension numerical semigroups arises in a natural way among the other numerical semigroups, they have become specially renowned due to the existing applications to commutative algebra via their associated semigroup ring (see for instance [1, 5, 15, 16, 99, 100]). They are a source of examples of commutative rings with some maximal proper...

متن کامل

Symmetric Numerical Semigroups with Arbitrary Multiplicity and Embedding Dimension

We construct symmetric numerical semigroups S for every minimal number of generators μ(S) and multiplicity m(S), 2 ≤ μ(S) ≤ m(S) − 1. Furthermore we show that the set of their defining congruence is minimally generated by μ(S)(μ(S) − 1)/2 − 1 elements.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2010

ISSN: 1077-8926

DOI: 10.37236/410